Erratum to: “Algorithm for multiplying two octonions”

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Derivation of a low multiplicative complexity algorithm for multiplying hyperbolic octonions

Abstract. We present an efficient algorithm to multiply two hyperbolic (countercomplex) octonions. The direct multiplication of two hyperbolic octonions requires 64 real multiplications and 56 real additions. More effective solutions still do not exist. We show how to compute a product of the hyperbolic octonions with 26 real multiplications and 92 real additions. During synthesis of the discus...

متن کامل

A new algorithm for multiplying two Dirac numbers

In this work a rationalized algorithm for Dirac numbers multiplication is presented. This algorithm has a low computational complexity feature and is well suited to FPGA implementation. The computation of two Dirac numbers product using the naïve method takes 256 real multiplications and 240 real additions, while the proposed algorithm can compute the same result in only 88 real multiplications...

متن کامل

Algorithm for Multiplying Schubert Classes

Based on the multiplicative rule of Schubert classes obtained in [Du3], we present an algorithm computing the product of two arbitrary Schubert classes in a flag variety G/H, where G is a compact connected Lie group and H ⊂ G is the centralizer of a one-parameter subgroup in G. Since all Schubert classes on G/H constitute an basis for the integral cohomology H∗(G/H), the algorithm gives a metho...

متن کامل

An algorithm for multiplication of split-octonions

In this paper we introduce efficient algorithm for the multiplication of split-octonions. The direct multiplication of two split-octonions requires 64 real multiplications and 56 real additions. More effective solutions still do not exist. We show how to compute a product of the split-octonions with 28 real multiplications and 92 real additions. During synthesis of the discussed algorithm we us...

متن کامل

Fast, Parallel Algorithm for Multiplying Polynomials with Integer Coefficients

This paper aims to develop and analyze an effective parallel algorithm for multiplying polynomials and power series with integer coefficients. Such operations are of fundamental importance when generating parameters for public key cryptosystems, whereas their effective implementation translates directly into the speed of such algorithms in practical applications. The algorithm has been designed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Radioelectronics and Communications Systems

سال: 2013

ISSN: 0735-2727,1934-8061

DOI: 10.3103/s073527271301007x